11![Journal of Algorithms 31, 132᎐195 Ž1999. Article ID jagm, available online at http:rrwww.idealibrary.com on Sylow Subgroups in ParallelU William M. Kantor † Department of Mathematics, Uni¨ ersity of Orego Journal of Algorithms 31, 132᎐195 Ž1999. Article ID jagm, available online at http:rrwww.idealibrary.com on Sylow Subgroups in ParallelU William M. Kantor † Department of Mathematics, Uni¨ ersity of Orego](https://www.pdfsearch.io/img/75a0c3d2fa2c933ffcf7890cd8d8cf55.jpg) | Add to Reading ListSource URL: darkwing.uoregon.edu- Date: 2003-07-18 22:01:56
|
---|
12![Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning Matthew Streeter Duolingo, Inc.∗ Pittsburgh, PA Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning Matthew Streeter Duolingo, Inc.∗ Pittsburgh, PA](https://www.pdfsearch.io/img/040b458550179019b9f6aed0280cdf41.jpg) | Add to Reading ListSource URL: papers.nips.cc- Date: 2014-12-02 18:40:07
|
---|
13![Journal of Algorithms 42, 69–doi:jagm, available online at http://www.idealibrary.com on On Graph Powers for Leaf-Labeled Trees Naomi Nishimura1 and Prabhakar Ragde2 Department of Computer Journal of Algorithms 42, 69–doi:jagm, available online at http://www.idealibrary.com on On Graph Powers for Leaf-Labeled Trees Naomi Nishimura1 and Prabhakar Ragde2 Department of Computer](https://www.pdfsearch.io/img/abace2777bc7986d0632dbc2f63b229d.jpg) | Add to Reading ListSource URL: users.uoa.gr- Date: 2014-06-11 17:30:29
|
---|
14![arXiv:1611.00507v1 [cs.DS] 2 NovWorst Case Competitive Analysis of Online Algorithms for Conic Optimization Reza Eghbali arXiv:1611.00507v1 [cs.DS] 2 NovWorst Case Competitive Analysis of Online Algorithms for Conic Optimization Reza Eghbali](https://www.pdfsearch.io/img/aa291b8492bb8ba9171a5ae44b86a880.jpg) | Add to Reading ListSource URL: arxiv.org- Date: 2016-11-02 20:16:04
|
---|
15![Decentralized Online Learning Algorithms for Opportunistic Spectrum Access Yi Gai and Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering, University of Southern California, CA 90089, USA Email: {ygai, Decentralized Online Learning Algorithms for Opportunistic Spectrum Access Yi Gai and Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering, University of Southern California, CA 90089, USA Email: {ygai,](https://www.pdfsearch.io/img/8e0c4639f9be03e56010a7dbd0f2c954.jpg) | Add to Reading ListSource URL: www-scf.usc.edu- Date: 2011-07-08 03:24:17
|
---|
16![Journal of Algorithms 32, 167᎐194 Ž1999. Article ID jagm, available online at http:rrwww.idealibrary.com on Graphs with Branchwidth at Most ThreeU Hans L. Bodlaender Department of Computer Science, Utrecht U Journal of Algorithms 32, 167᎐194 Ž1999. Article ID jagm, available online at http:rrwww.idealibrary.com on Graphs with Branchwidth at Most ThreeU Hans L. Bodlaender Department of Computer Science, Utrecht U](https://www.pdfsearch.io/img/f5b714c084393bb53c6ce9b9f516e2df.jpg) | Add to Reading ListSource URL: users.uoa.gr- Date: 2014-06-11 17:30:27
|
---|
17![Journal of Computer and System Sciences – 307 www.elsevier.com/locate/jcss Efficient algorithms for online decision problems夡 Adam Kalaia,∗ , Santosh Vempalab a Department of Computer Science, Toyota Journal of Computer and System Sciences – 307 www.elsevier.com/locate/jcss Efficient algorithms for online decision problems夡 Adam Kalaia,∗ , Santosh Vempalab a Department of Computer Science, Toyota](https://www.pdfsearch.io/img/bea666cbac96d471ceb30f36dc1d552a.jpg) | Add to Reading ListSource URL: research.microsoft.com- Date: 2011-03-02 19:16:19
|
---|
18![An Experimental Study of Online S
heduling Algorithms Susanne Albersy Bian
a S
hroderz Abstra
t An Experimental Study of Online S
heduling Algorithms Susanne Albersy Bian
a S
hroderz Abstra
t](https://www.pdfsearch.io/img/f1ce71fee8d998d3a22d5bc287d8220a.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 11:04:40
|
---|
19![2013 IEEE 33rd International Conference on Distributed Computing Systems Towards an Efficient Online Causal-Event-Pattern-Matching Framework Sukanta Pramanik 2013 IEEE 33rd International Conference on Distributed Computing Systems Towards an Efficient Online Causal-Event-Pattern-Matching Framework Sukanta Pramanik](https://www.pdfsearch.io/img/f982cd9bb193ca14ef3585a577f201f1.jpg) | Add to Reading ListSource URL: cs.uwaterloo.caLanguage: English - Date: 2014-03-03 13:51:30
|
---|
20![Teaching Media Quarterly Volume 4, Edition 1: Teaching BlackLivesMatter #BlackLivesMatter as A Case Study in the Politics of Digital Media: Algorithms, Hashtag Publics, and Organizing Protest Online Overview and Rational Teaching Media Quarterly Volume 4, Edition 1: Teaching BlackLivesMatter #BlackLivesMatter as A Case Study in the Politics of Digital Media: Algorithms, Hashtag Publics, and Organizing Protest Online Overview and Rational](https://www.pdfsearch.io/img/bc94f4ec351c7bd1de10e5342c289808.jpg) | Add to Reading ListSource URL: www.teachingmedia.orgLanguage: English - Date: 2016-04-04 10:48:10
|
---|